A Geometric-Combinatorial Approach to Index and Stability in Bimatrix Games Arndt von Schemde London School of Economics and Political Science

Source URL: www.maths.lse.ac.uk

• Game theory
• Bimatrix game
• LemkeHowson algorithm
• Nash equilibrium
• Brouwer fixed-point theorem
• Solution concept
• Simplex
• Coordination game

Electronic Notes in Discrete Mathematics–1072 Finding Gale Strings Marta M. Casetti, Julian Merschen, Bernhard von Stengel Dept. of Mathematics, London School of Economics, London WC2A 2AE, United Kingd

Source URL: www.maths.lse.ac.uk

• Mathematics
• Geometry
• Space
• Polytopes
• Topology
• Polyhedral combinatorics
• Game theory
• LemkeHowson algorithm
• Cyclic polytope
• Simplex
• Bimatrix game
• Simple polytope

AM 121: Intro to Optimization Models and Methods Lecture 5: Tableau, first look at the simplex algorithm Yiling Chen

Source URL: am121.seas.harvard.edu

COMPUTING THE EHRHART QUASI-POLYNOMIAL OF A RATIONAL SIMPLEX Alexander Barvinok April 2005 We present a polynomial time algorithm to compute any fixed number of the highest

Source URL: www.math.lsa.umich.edu

• Algebra
• Mathematics
• Abstract algebra
• Polytopes
• Lie groups
• Lie algebras
• Algebraic geometry
• Ehrhart polynomial
• Valuation
• Lattice
• Distribution
• Weight

GAMES AND ECONOMIC BEHAVIOR ARTICLE NO. 14, 247–

Source URL: www.maths.lse.ac.uk

• Mathematical analysis
• Mathematics
• Algebra
• Linear algebra
• Linear complementarity problem
• Mathematical optimization
• Simplex algorithm
• Exponentiation
• SturmLiouville theory
• Hypergeometric function

The Simplex Algorithm is NP-mighty‡ Yann Disser∗ Abstract We propose to classify the power of algorithms by the complexity of the problems that they can be used to solve. Instead of restricting to the problem a parti

Source URL: www.coga.tu-berlin.de

arXiv:1210.4694v2 [cs.DM] 5 Apr 2014

Source URL: www.maths.lse.ac.uk

• Polytopes
• Game theory
• LemkeHowson algorithm
• Matching
• Simplex

The simplex algorithm and the Hirsch conjecture: Lecture 3

Source URL: madalgo.au.dk

An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm Thomas Dueholm Hansen∗ Uri Zwick†

Source URL: cs.au.dk

On Survivable Access Network Design: Complexity and Algorithms Dahai Xu Elliot Anshelevich

Source URL: www.cs.rpi.edu

• Combinatorial optimization
• Graph theory
• NP-complete problems
• Network theory
• Edsger W. Dijkstra
• Steiner tree problem
• Simplex
• Matching
• Bipartite graph
• Graph
• Shortest path problem
• A* search algorithm